Consistency landscape of network communities

The concept of community detection has long been used as a key device for handling the mesoscale structures in networks. Suitably conducted reveals various embedded informative substructures network topology. However, regarding practical usage detection, it always tricky problem to assign reasonable resolution networks interest. Because absence unanimously accepted criterion, most previous studies utilized rather ad hoc heuristics decide resolution. In this work, we harness consistency provide overall landscape networks, which eventually take quantify reliability detected communities given parameter. More precisely, exploit ambiguity results stochastic algorithms and suggest method that denotes relative validity regard their stability global local inconsistency measures using multiple processes. Applying our framework synthetic real confirm effectively displays insightful fundamental aspects structures.